Method and system for quantum-resistant hashing scheme

ABSTRACT

A method for verifying proof of assertion of a value using a hash-oriented transaction scheme includes: receiving a confirmation request; identifying a confirmation message, wherein the confirmation message includes at least one or more chain values and is one of: included in the confirmation request or stored in a block included in a blockchain and identified using a reference identifier included in the confirmation request; identifying a declaration message, wherein the declaration message includes at least an asserted value and an identity hash value; generating a check hash value by hashing at least the asserted value and the one or more chain values; verifying the check hash value using the identity hash value; and transmitting a result of the verification of the check hash value in response to the received confirmation request.

FIELD

The present disclosure relates to being able to verify proof of anassertion, such as a presented identity or contract, through the use ofa hashing scheme that is resistant to being broken or solved through theuse of computing techniques including quantum computing.

BACKGROUND

Many cryptographic techniques revolve around the use of complexalgorithms that include mathematical problems that are nearly impossiblefor a standard computer to solve. For example, blockchains and othertechnology that relies on the use of digital signatures often utilizeRSA (Rivest-Shamir-Adleman), which relies on prime factorization, orECDSA (elliptic curve digital signature algorithm), which uses adiscrete logarithmic problem. In both cases, standard computers are tooslow and inefficient to solve these mathematical problems, making therelated algorithms suitably cryptographically secure.

However, quantum computing is being developed, which, if successful, hasthe potential to solve such mathematical problems. As a result, the useof digital signatures through algorithms such as RSA and ECDSA maybecome ineffective when the underlying math problems can be solved,giving rise to a number of vulnerabilities and security threats. Inaddition, traditional hash-based signatures have data sizes that are tooimpractical for use. Thus, there is a need for a technological systemwhere a cryptographic technique can be used that is resistant to solvingefforts by even quantum computing while still providing the proof ofidentities and assertions available from existing algorithms.

SUMMARY

The present disclosure provides a description of systems and methods forproof of assertion of a value using a hash-oriented transaction scheme.The use of hashing instead of a standard algorithm that relies on amathematical problem provides for resistance against quantum computing,particularly when a sufficient complex hash is used with a resultingvalue that is of sufficient size to be resistant to collision, such asSHA-256. A blockchain is used to store declarations, where blockchainprovides an immutable and time-stamped record of declaration messages.The declaration includes a value that a user may later want to prove,such as an identity document, contract, land deed, voting record, etc.The declaration also includes a hash value that is generated by hashingthe value as well as one or more other items that are known only to theuser. When the user wants to prove ownership of that value, or otherwiseattest to its authenticity, the user can make a confirmation message onthe blockchain. The confirmation message includes the one or more otheritems that were used to create the hash value stored in the declaration.By revealing those values being known to the user, any entity wishing toaudit the user's assertion can compute the hash value using the value tobe attested-to and the one or more other items in the confirmationmessage and check it against the hash value in the declaration. A matchproves the user's assertion successful. The result is a system that isresistant to quantum computing, while still enabling a user to quickly,easily, and securely prove assertion of a value through use of hashingand blockchain.

A method for verifying proof of assertion of a value using ahash-oriented transaction scheme includes: receiving, by a receiver of aprocessing server, a confirmation request; identifying, by a processingdevice of the processing server, a confirmation message, wherein theconfirmation message includes at least one or more chain values and isone of: included in the confirmation request or stored in a blockincluded in a blockchain and identified using a reference identifierincluded in the confirmation request; identifying, by the processingdevice of the processing server, a declaration message, wherein thedeclaration message includes at least an asserted value and an identityhash value; generating, by the processing device of the processingserver, a check hash value by hashing at least the asserted value andthe one or more chain values; verifying, by the processing device of theprocessing server, the check hash value using the identity hash value;and transmitting, by a transmitter of the processing server, a result ofthe verification of the check hash value in response to the receivedconfirmation request.

A system for verifying proof of assertion of a value using ahash-oriented transaction scheme includes: a receiver of a processingserver configured to receive a confirmation request; a processing deviceof the processing server configured to identify a confirmation message,wherein the confirmation message includes at least one or more chainvalues and is one of: included in the confirmation request or stored ina block included in a blockchain and identified using a referenceidentifier included in the confirmation request, identify a declarationmessage, wherein the declaration message includes at least an assertedvalue and an identity hash value, generate a check hash value by hashingat least the asserted value and the one or more chain values, and verifythe check hash value using the identity hash value; and a transmitter ofthe processing server configured to transmit a result of theverification of the check hash value in response to the receivedconfirmation request.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The scope of the present disclosure is best understood from thefollowing detailed description of exemplary embodiments when read inconjunction with the accompanying drawings. Included in the drawings arethe following figures:

FIG. 1 is a block diagram illustrating a high level system architecturefor proving an assertion of a value using a hash-oriented transactionscheme and blockchain in accordance with exemplary embodiments.

FIG. 2 is a block diagram illustrating the processing server of thesystem of FIG. 1 for verifying an assertion of a value using ahash-oriented transaction scheme and blockchain in accordance withexemplary embodiments.

FIG. 3 is a diagram illustrating example declaration and confirmationmessages that may be stored in the blockchain of FIG. 1 in accordancewith exemplary embodiments.

FIGS. 4A and 4B are a flow diagram illustrating a process for verifyingan asserted value using a hash-oriented transaction scheme andblockchain in the system of FIG. 1 in accordance with exemplaryembodiments.

FIG. 5 is a flow chart illustrating an exemplary method for verifyingproof of assertion of a value using a hash-oriented transaction schemein accordance with exemplary embodiments.

FIG. 6 is a block diagram illustrating a computer system architecture inaccordance with exemplary embodiments.

Further areas of applicability of the present disclosure will becomeapparent from the detailed description provided hereinafter. It shouldbe understood that the detailed description of exemplary embodiments areintended for illustration purposes only and are, therefore, not intendedto necessarily limit the scope of the disclosure.

DETAILED DESCRIPTION Glossary of Terms

Blockchain—A shared ledger of all transactions of a blockchain-baseddigital asset, such as a cryptographic currency. One or more computingdevices may comprise a blockchain network, which may be configured toprocess and record transactions as part of a block in the blockchain.Once a block is completed, the block is added to the blockchain and thetransaction record thereby updated. In many instances, the blockchainmay be a ledger of transactions in chronological order, or may bepresented in any other order that may be suitable for use by theblockchain network. In some configurations, transactions recorded in theblockchain may include a destination address and a digital asset amount,such that the blockchain records what asset(s) is attributable to aspecific address. In some instances, the transactions are financial andothers not financial, or might include additional or differentinformation, such as a source address, timestamp, etc. In someembodiments, a blockchain may also or alternatively include nearly anytype of data as a form of transaction that is or needs to be placed in adistributed database that maintains a continuously growing list of datarecords hardened against tampering and revision, even by its operators,and may be confirmed and validated by the blockchain network throughproof of work and/or any other suitable verification techniquesassociated therewith. In some cases, data regarding a given transactionmay further include additional data that is not directly part of thetransaction appended to transaction data. In some instances, theinclusion of such data in a blockchain may constitute a transaction. Insuch instances, a blockchain may not be directly associated with aspecific digital, virtual, fiat, or other type of currency.

System for Proof of Assertion Using Hashing and Blockchain

FIG. 1 illustrates a system 100 for verifying proof of assertion of avalue through the use of a hash-oriented transaction scheme and ablockchain.

The system 100 may include a processing server 102. The processingserver 102, discussed in more detail below, may be configured to verifyproof supplied by a user 104 asserting to a specific value. In thesystem 100, the specific value may be supplied by a user 104 to ablockchain associated with a blockchain network 106. The specific valuemay be submitted to the blockchain network 106 by the user 104 in adeclaration message, discussed in more detail below.

The blockchain network 106 may be comprised of a plurality of nodes.Each node may be a computing system that is configured to performfunctions related to the processing and management of the blockchain,including the generation of blockchain data values, verification ofproposed blockchain transactions, verification of digital signatures,generation of new blocks, validation of new blocks, and maintenance of acopy of the blockchain. The blockchain may be a distributed ledger thatis comprised of at least a plurality of blocks. Each block may includeat least a block header and one or more data values. Each block headermay include at least a timestamp, a block reference value, and a datareference value. The timestamp may be a time at which the block headerwas generated, and may be represented using any suitable method (e.g.,UNIX timestamp, DateTime, etc.). The block reference value may be avalue that references an earlier block (e.g., based on timestamp) in theblockchain. In some embodiments, a block reference value in a blockheader may be a reference to the block header of the most recently addedblock prior to the respective block. In an exemplary embodiment, theblock reference value may be a hash value generated via the hashing ofthe block header of the most recently added block. The data referencevalue may similarly be a reference to the one or more data values storedin the block that includes the block header. In an exemplary embodiment,the data reference value may be a hash value generated via the hashingof the one or more data values. For instance, the block reference valuemay be the root of a Merkle tree generated using the one or more datavalues.

The use of the block reference value and data reference value in eachblock header may result in the blockchain being immutable. Any attemptedmodification to a data value would require the generation of a new datareference value for that block, which would thereby require thesubsequent block's block reference value to be newly generated, furtherrequiring the generation of a new block reference value in everysubsequent block. This would have to be performed and updated in everysingle node in the blockchain network 106 prior to the generation andaddition of a new block to the blockchain in order for the change to bemade permanent. Computational and communication limitations may makesuch a modification exceedingly difficult, if not impossible, thusrendering the blockchain immutable.

Each blockchain data value may correspond to a confirmation message, asdiscussed below, or a declaration message. A declaration message may besubmitted to a node in the blockchain network by a user 104 using asuitable computing device 108, such as a desktop computer, laptopcomputer, notebook computer, tablet computer, cellular phone, smartphone, smart watch, smart television, wearable computing device, or anyother type of computing device specifically configured to perform thefunctions discussed herein. The declaration message may include thespecific value that the user 104 may later want to prove, either asproof of the value itself as genuine, proof of ownership of the value,etc. For example, the specific value may be an identity document, whereuse of the methods discussed herein may enable the user 104 to provethat they are the person detailed in the identity document. In anotherexample, the specific value may be a land deed, where the methodsdiscussed herein enable the user 104 to prove that they are the owner ofthe land deed and thus the land to which it applies.

The declaration message may also include a hash value, also referred toherein as an “identity hash value.” The hash value may be generated byhashing the specific value and one or more additional values, referredto herein as “chain values.” The chain values may be known to the user104 when the declaration message is submitted, but may be otherwiseunknown to any other entity, particularly any node in the blockchainnetwork 106. The user 104 may generate the identity hash value viahashing the specific value and the chain value(s) using any suitablehashing algorithm, such as SHA-256. In an exemplary embodiment, acollision-resistant hashing algorithm may be used. In a preferredembodiment, at least two chain values may be used in generating the hashvalue. The user 104 may submit the declaration message to a node in theblockchain network 106, with the declaration message including at leastthe specific value and the identity hash value. The declaration messagemay then be included in a new block that is verified and added to theblockchain.

In the system 100, a requesting system 110 may request that the user 104provide proof of an assertion of the specific value. For instance, inthe example where the specific value is an identity document, therequesting system 110 may request that the user 104 provide proof oftheir identity. In such an example, the user 104 may use the blockchainand the identity hash value to prove that they are the individualindicated in the identity document stored in the declaration message.The requesting system 110 may submit a confirmation request to theprocessing server 102. The confirmation request may indicate thedeclaration message for which the requesting system 110 wantsverification. In some cases, each declaration message may include aunique identifier, which may be included in the confirmation request foruse by the processing server 102 in identifying the declaration message.

The processing server 102 may then attempt to verify the value includedin the declaration message via proof of an assertion provided by theuser 104. The verification may be performed through the use of aconfirmation message stored in the blockchain. The confirmation messagemay be submitted by the user 104 (e.g., via the computing device 108) toa node in the blockchain network 106 when verification is requested. Insome cases, the processing server 102 may request that the user 104submit the confirmation message (e.g., after receiving the confirmationrequest from the requesting system 110, where contact information forthe user 104 may be included in the confirmation request). In someinstances, the requesting system 110 may request that the user 104 postthe confirmation message. For instance, in the above example, when therequesting system 110 requests that the user 104 provide proof of theiridentity, the user 104 may respond by submitting the confirmationmessage to the blockchain and providing the requesting system 110 withthe identifier for the declaration message that includes their identitydocument.

To verify the user's proof of the assertion of the specific value, theprocessing server 102 may first identify the confirmation message storedin the blockchain. In some cases, each confirmation message may includethe identifier found in the declaration message to which it corresponds.In other cases, each confirmation message may include its ownidentifier, where identifiers are thereby unique to all messages in theblockchain, where the user 104 or requesting system 110 may provide thatidentifier to the processing server 102 for use in identifying theconfirmation message.

A confirmation message may include at least the check value(s) that wereused by the user 104 when generating the identity hash value that wasstored in the declaration message. The processing server 102 mayidentify the check value(s) in the confirmation message, and thengenerate a check hash value using the check value(s) and the specificvalue that is included in the identified declaration message. Theprocessing server 102 can then check the check hash value against theidentity hash value found in the declaration message to see if there isa match. If there is a match, then that means that the user 104 had tohave possession of the specific value when it was added to theblockchain (e.g., at the timestamp found in the block header of theblock that includes the declaration message) since they had the checkvalue(s) used to generate the identity hash value. This may serve asproof of the assertion of the specific value, where the processingserver 102 may then notify the requesting system 110 accordingly. Ifthere is no match between the check hash value and the identity hashvalue, then the processing server 102 may inform the requesting system110 accordingly that the user's attempted proof failed.

Thus, the methods and systems discussed herein enable a user 104 toassert ownership or existing of a value at a specific time through theuse of a blockchain, where proof of that assertion can be verifiedthrough the use of a hash-oriented transaction scheme via the use of alater-submitted confirmation message to the blockchain. The verificationcan be performed easily by the processing server 102 speciallyconfigured as disclosed herein, enabling a requesting system 110 to havethe proof verified easily and without having to perform any complicatedactions itself. In addition, by using a hash instead of a digitalsignature, the methods discussed herein are resistant to attemptedsolves through quantum computing, while a sufficient complex hashingalgorithm ensures a lack of collisions, thereby resulting in a secure,yet easily implemented system.

In some embodiments, confirmation and declaration messages may bechained together to provide for additional security regarding proof ofownership and assertions, as well as to transfer ownership of thespecific value to another user. Chaining may be performed through theuse of additional chain values. For instance, a confirmation message mayinclude two chain values that are used in calculating the identity hashvalue found in a declaration message. The declaration message mayinclude two new chain values. These new chain values may be part of ahash chain used in a new declaration and confirmation messagecombination.

For example, a declaration message may include a value X and an identityhash value generated by hashing a combination of X, A, and B. Thus, Aand B may be the chain values that are found in the confirmation messageused in verification of the value X. The declaration message may furtherinclude two new chain values, C₂ and D₂. A subsequent declarationmessage may be submitted by the user 104 for a later proof round of thevalue X, where the declaration message may include an identity hashvalue generated by hashing a combination of X, C₁, and D₁. The valuesfor C₂ and D₂ may be related to the values of C₁ and D₁, such as beingthe hashes of the values of C₁ and D₁, where C₂=H(C₁) and D₂=H(D₁),where H refers to a hashing operation.

In an example, a voter may be required to prove their identity with avoting administrator prior to voting in a public election, where theiridentity document is the value X. The voter may be in possession of C₁and can generate C₂ as needed via hashing. To establish the proof ofidentity, the voting administrator may provide the voter with D₁. Thevoter may generate D₂ via hashing D₁ and then post the declarationmessage that includes C₂, D₂, the identity document, and the hash ofC₁+D₁+the identity document. At this time, the voting administrator cansee the declaration and recognize D₂ based on their provided value. Thevoting administrator can then wait for the voter to post theconfirmation message of their own C₁ with the supplied D₁, and use thevalues to confirm the hash in the declaration message. Once confirmed,it proves the possession of the identity document by the voter, and thevoter's identity can thus be verified.

In some cases, one of the new chain values used in a declaration messagemay be part of a new hash chain. For instance, the user 104 may submit afirst declaration message for a value X that includes an identity hashvalue of H(X+A₁+B₁) (where the corresponding confirmation messageincludes chain values A₁ and B₁). The first declaration message may alsoinclude new chain values of A₂ and B₂. For a second declaration message,a new hash chain may be utilized, such that the second declarationmessage includes the value X and an identity hash value of H(X+B₃+C₁).The confirmation message for the second declaration message may thusinclude chain values of B₃ and C₁. Thus, a nefarious actor could notsimply continue to hash the chain values in a declaration message toattempt to guess at a later declaration-confirmation combination since anew hash chain, C₁ is used. Similarly, if the user 104 wants to transferownership of the value X, they can be given the identity hash valueH(X+B₃+C₁) from the new user, where the new user knows the value of C₁with it being unknown to the user 104. Thus, only the new user canprovide the verifiable proof of the assertion of value X. Accordingly,the use of hash chains or other newly introduced chain values indeclaration messages can be used to easily transfer ownership or otherassertions of a value in the system 100.

Processing Server

FIG. 2 illustrates an embodiment of a processing server 102 in thesystem 100. It will be apparent to persons having skill in the relevantart that the embodiment of the processing server 102 illustrated in FIG.2 is provided as illustration only and may not be exhaustive to allpossible configurations of the processing server 102 suitable forperforming the functions as discussed herein. For example, the computersystem 600 illustrated in FIG. 6 and discussed in more detail below maybe a suitable configuration of the processing server 102.

The processing server 102 may include a receiving device 202. Thereceiving device 202 may be configured to receive data over one or morenetworks via one or more network protocols. In some instances, thereceiving device 202 may be configured to receive data from blockchainnetworks 106, computing devices 108, requesting systems 110, and othersystems and entities via one or more communication methods, such asradio frequency, local area networks, wireless area networks, cellularcommunication networks, Bluetooth, the Internet, etc. In someembodiments, the receiving device 202 may be comprised of multipledevices, such as different receiving devices for receiving data overdifferent networks, such as a first receiving device for receiving dataover a local area network and a second receiving device for receivingdata via the Internet. The receiving device 202 may receiveelectronically transmitted data signals, where data may be superimposedor otherwise encoded on the data signal and decoded, parsed, read, orotherwise obtained via receipt of the data signal by the receivingdevice 202. In some instances, the receiving device 202 may include aparsing module for parsing the received data signal to obtain the datasuperimposed thereon. For example, the receiving device 202 may includea parser program configured to receive and transform the received datasignal into usable input for the functions performed by the processingdevice to carry out the methods and systems described herein.

The receiving device 202 may be configured to receive data signalselectronically transmitted by nodes in blockchain networks 106 that maybe superimposed or otherwise encoded with blockchain data, includingblockchain data values that may include confirmation messages anddeclaration messages. In some embodiments, the receiving device 202 mayreceive a full copy of the blockchain including all new blocks. In otherembodiments, the receiving device 202 may receive blocks as requested.In other embodiments, the receiving device 202 may receive blockchaindata values. In some embodiments, the processing server 102 may be anode in the blockchain network 106 and may receive blocks forverification and addition to the blockchain from other nodes in theblockchain network 106. The receiving device 202 may also be configuredto receive data signals electronically transmitted by computing devices108 and/or requesting systems 110 that are superimposed or otherwiseencoded with confirmation requests, which may include identifiers fordeclaration and/or confirmation messages.

The processing server 102 may also include a communication module 204.The communication module 204 may be configured to transmit data betweenmodules, engines, databases, memories, and other components of theprocessing server 102 for use in performing the functions discussedherein. The communication module 204 may be comprised of one or morecommunication types and utilize various communication methods forcommunications within a computing device. For example, the communicationmodule 204 may be comprised of a bus, contact pin connectors, wires,etc. In some embodiments, the communication module 204 may also beconfigured to communicate between internal components of the processingserver 102 and external components of the processing server 102, such asexternally connected databases, display devices, input devices, etc. Theprocessing server 102 may also include a processing device. Theprocessing device may be configured to perform the functions of theprocessing server 102 discussed herein as will be apparent to personshaving skill in the relevant art. In some embodiments, the processingdevice may include and/or be comprised of a plurality of engines and/ormodules specially configured to perform one or more functions of theprocessing device, such as a querying module 218, generation module 220,verification module 222, etc. As used herein, the term “module” may besoftware or hardware particularly programmed to receive an input,perform one or more processes using the input, and provides an output.The input, output, and processes performed by various modules will beapparent to one skilled in the art based upon the present disclosure.

The processing server 102 may include a querying module 218. Thequerying module 218 may be configured to execute queries on databases toidentify information. The querying module 218 may receive one or moredata values or query strings, and may execute a query string basedthereon on an indicated database, such as a memory 226, to identifyinformation stored therein. The querying module 218 may then output theidentified information to an appropriate engine or module of theprocessing server 102 as necessary. The querying module 218 may, forexample, execute a query on the memory 226 to identify a declarationmessage or a confirmation message stored in a block in the blockchain,such as using an identifier.

The processing server 102 may also include a generation module 220. Thegeneration module 220 may be configured to generate data for use by theprocessing server 102 in performing the functions discussed herein. Thegeneration module 220 may receive instructions as input, may generatedata based on the instructions, and may output the generated data to oneor more modules of the processing server 102. For example, thegeneration module 220 may be configured to generate notifications andother data messages for transmission to computing devices 108 orrequesting systems 110, such as prompts for confirmation messages and/oridentifiers or results of attempted verifications, as well as fortransmission to nodes in the blockchain network 106, such as requestingnew blocks or blockchain data values. The generation module 220 may alsobe configured to generate check hash values by hashing data. Inembodiments where the processing server 102 is a node in the blockchainnetwork 106, the generation module 220 may also be configured togenerate block headers and new blocks for validation and adding to theblockchain.

The processing server 102 may also include a verification module 222.The verification module 222 may be configured to verify data as part ofthe functions of the processing server 102 as discussed herein. Theverification module 222 may receive data to be verified as input, mayattempt to verify the data, and may output a result of the verificationto another module or engine of the processing server 102. In some cases,the input may include data to be used in the verification. In someinstances, the verification module 222 may be configured to identifydata to be used in the verification, such as by instructing thegeneration module 220 to generate a check hash value using chain valuesin a declaration message for use of the check hash value by theverification module 222. The verification module 222 may be configuredto, for example, verify identity hash values found in declarationmessages using check hash values generated using the chain values foundin a corresponding confirmation message.

The processing server 102 may also include a transmitting device 224.The transmitting device 224 may be configured to transmit data over oneor more networks via one or more network protocols. In some instances,the transmitting device 224 may be configured to transmit data toblockchain networks 106, computing devices 108, requesting systems 110,and other entities via one or more communication methods, local areanetworks, wireless area networks, cellular communication, Bluetooth,radio frequency, the Internet, etc. In some embodiments, thetransmitting device 224 may be comprised of multiple devices, such asdifferent transmitting devices for transmitting data over differentnetworks, such as a first transmitting device for transmitting data overa local area network and a second transmitting device for transmittingdata via the Internet. The transmitting device 224 may electronicallytransmit data signals that have data superimposed that may be parsed bya receiving computing device. In some instances, the transmitting device224 may include one or more modules for superimposing, encoding, orotherwise formatting data into data signals suitable for transmission.

The transmitting device 224 may be configured to electronically transmitdata signals to nodes in blockchain networks 106 that are superimposedor otherwise encoded with requests for blockchain data values or blocks,which may include identifiers for declaration or conformation messages.The transmitting device 224 may also be configured to electronicallytransmit data signals to computing devices 108, which may besuperimposed or otherwise encoded with requests for submission ofconfirmation messages, request for identifiers for confirmationmessages, etc. The transmitting device 224 may also be configured toelectronically transmit data signals to requesting systems 110, whichmay be superimposed or otherwise encoded with verification results.

The processing server 102 may also include a memory 226. The memory 226may be configured to store data for use by the processing server 102 inperforming the functions discussed herein, such as public and privatekeys, symmetric keys, etc. The memory 226 may be configured to storedata using suitable data formatting methods and schema and may be anysuitable type of memory, such as read-only memory, random access memory,etc. The memory 226 may include, for example, encryption keys andalgorithms, communication protocols and standards, data formattingstandards and protocols, program code for modules and applicationprograms of the processing device, and other data that may be suitablefor use by the processing server 102 in the performance of the functionsdisclosed herein as will be apparent to persons having skill in therelevant art. In some embodiments, the memory 226 may be comprised of ormay otherwise include a relational database that utilizes structuredquery language for the storage, identification, modifying, updating,accessing, etc. of structured data sets stored therein. The memory 226may be configured to store, for example, blockchain data includingconfirmation messages and declaration messages, hashing algorithms forgenerating blocks, hashing algorithms for generating check hash values,credentials for validation, usage rule templates, communication data forblockchain nodes, communication data for computing devices 108 andrequesting systems 110, etc.

Declaration and Confirmation Messages

FIG. 3 illustrates example declaration and confirmation messages for usein the system 100 of FIG. 1 in the verification of proof of assertion ofa value.

As discussed above, the user 104 may submit a declaration message 302 tothe blockchain network 106 for inclusion in a new block that is verifiedand added to the blockchain. The declaration message may include aspecific value 304, where the user 104 may want to assert proof of thespecific value 304 (e.g., such as an identity document in the examplediscussed above). The declaration message may also include an identityhash value 308, where the identity hash value is a hash value generatedvia hashing the specific value 304 as well as two chain values 312. Atthe time of submission of the declaration message 302, the chain values312 may be known to the user 104, but not to anyone else. Thedeclaration message 302 may also include two new chain values 306,illustrated in FIG. 3 as new chain values 306 a and 306 b, which may bepart of hash chains used for later declaration and confirmation messagepairs.

When the user 104 wants to prove assertion of the specific value 304,the user 104 may submit a confirmation message 310 to the blockchain.The confirmation message may include the chain values 312, illustratedin FIG. 3 as chain values 312 a and 312 b that were used to generate theidentity hash value 308. In some embodiments, the chain values 312 maybe part of hash chains with the new chain values 306. In the exampleillustrated in FIG. 3, new chain value 306 a may be a hash of chainvalue 312 a, and new chain value 306 b may be a hash of chain value 312b. In the illustrated example, chain value 312 a may be the start of anew hash chain, while chain value 312 b may be part of an existing hashchain, such as was used in an earlier set of declaration andconfirmation messages.

Process for Verifying Proof of Assertion Using Hashing and Blockchain

FIGS. 4A and 4B illustrate an example process in the system 100 of FIG.1 for verifying proof of assertion of a specific value presented by theuser 104 using the blockchain network 106 and a hashing-orientedtransaction scheme.

In step 402, the user 104 may, using the computing device 108, submit adeclaration message to the blockchain network 106. The declarationmessage may include at least an identifier, referred to herein as a dataentry identifier, a specific value and an identity hash value. In step404, the blockchain network 106 may receive the declaration message. Instep 406, the declaration message may be included in a new block that isverified and added to the blockchain. In some embodiments, the dataentry identifier for the declaration message may be identified by theblockchain network 106 in step 404 or 406, which may be returned to thecomputing device 108.

In step 408, the computing device 108 and requesting system 110 mayenter an arrangement. For instance, in the above example, the requestingsystem 110 may request that the user 104 provides proof of theiridentity, which the user 104 may attempt to accomplish using an identitydocument as the specific value included in the declaration message thatwas submitted to the blockchain network 106. In step 410, as part of thearrangement, the user 104 may, via the computing device 108, provide thedata entry identifier for the declaration message to the requestingsystem 110. In step 412, the requesting system 110 may submit aconfirmation request to the processing server 102 using a suitablecommunication network and method. The confirmation request may includeat least the data entry identifier.

In step 414, the receiving device 202 of the processing server 102 mayreceive the confirmation request from the requesting system 110. In step416, the processing server 102 may electronically transmit a requestmessage to the computing device 108, requesting that the user 104 submita confirmation message to the blockchain network 106 to assert proof ofthe specific value (e.g., the identity document in the above example).In step 418, the computing device 108 may receive the request messagefrom the processing server 102.

In step 420, the computing device 108 may submit a confirmation messageto the blockchain network 106. The confirmation message may include atleast the data entry identifier and one or more chain values. In step422, the blockchain network 106 may receive the confirmation message. Instep 424, the confirmation message may be included in a new block thatis generated, validated, and posted to the blockchain. In step 426, thereceiving device 202 of the processing server 102 may receive theconfirmation message via an update of the blockchain network. In step428, the generation module 220 of the processing server 102 may generatea check has value by hashing the chain values found in the confirmationmessage as well as the specific value found in the declaration message.

In step 430, the verification module 222 of the processing server 102may attempt verify the check hash value by comparing it to the identityhash value found in the declaration message, as verification of theproof of the assertion by the user 104. In step 432, the transmittingdevice 224 of the processing server 102 may electronically transmit aconfirmation notification to the requesting system 110. The confirmationnotification may include a result of the verification, which, ifsuccessful, may confirm the user's assertion (e.g., that they are theperson identified in the identity document in the above example). Instep 434, the requesting system 110 may receive the confirmationnotification from the processing server 102.

Exemplary Method for Verifying Proof of Assertion of a Value

FIG. 5 illustrates a method 500 for verifying proof of an assertion of avalue via the use of a blockchain combined with a hash-orientedtransaction scheme.

In step 502, a confirmation request may be received by a receiver (e.g.,the receiving device 202) of a processing server (e.g., the processingserver 102). In step 504, a confirmation message may be identified by aprocessing device (e.g., the querying module 218) of the processingserver, wherein the confirmation message includes at least one or morechain values and is one of: included in the confirmation request orstored in a block included in a blockchain and identified using areference identifier included in the confirmation request. In step 506,a declaration message may be identified by the processing device of theprocessing server, wherein the declaration message includes at least anasserted value and an identity hash value.

In step 508, a check hash value may be generated by the processingdevice (e.g., generation module 220) of the processing server by hashingat least the asserted value and the one or more chain values. In step510, the check has value may be verified by the processing device (e.g.,verification module 222) of the processing server using the identityhash value. In step 512, a result of the verification of the check hashvalue may be transmitted by a transmitter (e.g., the transmitting device224) of the processing server in response to the received confirmationrequest.

Computer System Architecture

FIG. 6 illustrates a computer system 600 in which embodiments of thepresent disclosure, or portions thereof, may be implemented ascomputer-readable code. For example, the processing server 102 of FIG. 1may be implemented in the computer system 600 using hardware, software,firmware, non-transitory computer readable media having instructionsstored thereon, or a combination thereof and may be implemented in oneor more computer systems or other processing systems. Hardware,software, or any combination thereof may embody modules and componentsused to implement the methods of FIGS. 3, 4A, 4B, and 5.

If programmable logic is used, such logic may execute on a commerciallyavailable processing platform configured by executable software code tobecome a specific purpose computer or a special purpose device (e.g.,programmable logic array, application-specific integrated circuit,etc.). A person having ordinary skill in the art may appreciate thatembodiments of the disclosed subject matter can be practiced withvarious computer system configurations, including multi-coremultiprocessor systems, minicomputers, mainframe computers, computerslinked or clustered with distributed functions, as well as pervasive orminiature computers that may be embedded into virtually any device. Forinstance, at least one processor device and a memory may be used toimplement the above described embodiments.

A processor unit or device as discussed herein may be a singleprocessor, a plurality of processors, or combinations thereof. Processordevices may have one or more processor “cores.” The terms “computerprogram medium,” “non-transitory computer readable medium,” and“computer usable medium” as discussed herein are used to generally referto tangible media such as a removable storage unit 618, a removablestorage unit 622, and a hard disk installed in hard disk drive 612.

Various embodiments of the present disclosure are described in terms ofthis example computer system 600. After reading this description, itwill become apparent to a person skilled in the relevant art how toimplement the present disclosure using other computer systems and/orcomputer architectures. Although operations may be described as asequential process, some of the operations may in fact be performed inparallel, concurrently, and/or in a distributed environment, and withprogram code stored locally or remotely for access by single ormulti-processor machines. In addition, in some embodiments the order ofoperations may be rearranged without departing from the spirit of thedisclosed subject matter.

Processor device 604 may be a special purpose or a general purposeprocessor device specifically configured to perform the functionsdiscussed herein. The processor device 604 may be connected to acommunications infrastructure 606, such as a bus, message queue,network, multi-core message-passing scheme, etc. The network may be anynetwork suitable for performing the functions as disclosed herein andmay include a local area network (LAN), a wide area network (WAN), awireless network (e.g., WiFi), a mobile communication network, asatellite network, the Internet, fiber optic, coaxial cable, infrared,radio frequency (RF), or any combination thereof. Other suitable networktypes and configurations will be apparent to persons having skill in therelevant art. The computer system 600 may also include a main memory 608(e.g., random access memory, read-only memory, etc.), and may alsoinclude a secondary memory 610. The secondary memory 610 may include thehard disk drive 612 and a removable storage drive 614, such as a floppydisk drive, a magnetic tape drive, an optical disk drive, a flashmemory, etc.

The removable storage drive 614 may read from and/or write to theremovable storage unit 618 in a well-known manner. The removable storageunit 618 may include a removable storage media that may be read by andwritten to by the removable storage drive 614. For example, if theremovable storage drive 614 is a floppy disk drive or universal serialbus port, the removable storage unit 618 may be a floppy disk orportable flash drive, respectively. In one embodiment, the removablestorage unit 618 may be non-transitory computer readable recordingmedia.

In some embodiments, the secondary memory 610 may include alternativemeans for allowing computer programs or other instructions to be loadedinto the computer system 600, for example, the removable storage unit622 and an interface 620. Examples of such means may include a programcartridge and cartridge interface (e.g., as found in video gamesystems), a removable memory chip (e.g., EEPROM, PROM, etc.) andassociated socket, and other removable storage units 622 and interfaces620 as will be apparent to persons having skill in the relevant art.

Data stored in the computer system 600 (e.g., in the main memory 608and/or the secondary memory 610) may be stored on any type of suitablecomputer readable media, such as optical storage (e.g., a compact disc,digital versatile disc, Blu-ray disc, etc.) or magnetic tape storage(e.g., a hard disk drive). The data may be configured in any type ofsuitable database configuration, such as a relational database, astructured query language (SQL) database, a distributed database, anobject database, etc. Suitable configurations and storage types will beapparent to persons having skill in the relevant art.

The computer system 600 may also include a communications interface 624.The communications interface 624 may be configured to allow software anddata to be transferred between the computer system 600 and externaldevices. Exemplary communications interfaces 624 may include a modem, anetwork interface (e.g., an Ethernet card), a communications port, aPCMCIA slot and card, etc. Software and data transferred via thecommunications interface 624 may be in the form of signals, which may beelectronic, electromagnetic, optical, or other signals as will beapparent to persons having skill in the relevant art. The signals maytravel via a communications path 626, which may be configured to carrythe signals and may be implemented using wire, cable, fiber optics, aphone line, a cellular phone link, a radio frequency link, etc.

The computer system 600 may further include a display interface 602. Thedisplay interface 602 may be configured to allow data to be transferredbetween the computer system 600 and external display 630. Exemplarydisplay interfaces 602 may include high-definition multimedia interface(HDMI), digital visual interface (DVI), video graphics array (VGA), etc.The display 630 may be any suitable type of display for displaying datatransmitted via the display interface 602 of the computer system 600,including a cathode ray tube (CRT) display, liquid crystal display(LCD), light-emitting diode (LED) display, capacitive touch display,thin-film transistor (TFT) display, etc.

Computer program medium and computer usable medium may refer tomemories, such as the main memory 608 and secondary memory 610, whichmay be memory semiconductors (e.g., DRAMs, etc.). These computer programproducts may be means for providing software to the computer system 600.Computer programs (e.g., computer control logic) may be stored in themain memory 608 and/or the secondary memory 610. Computer programs mayalso be received via the communications interface 624. Such computerprograms, when executed, may enable computer system 600 to implement thepresent methods as discussed herein. In particular, the computerprograms, when executed, may enable processor device 604 to implementthe methods illustrated by FIGS. 3, 4A, 4B, and 5, as discussed herein.Accordingly, such computer programs may represent controllers of thecomputer system 600. Where the present disclosure is implemented usingsoftware, the software may be stored in a computer program product andloaded into the computer system 600 using the removable storage drive614, interface 620, and hard disk drive 612, or communications interface624.

The processor device 604 may comprise one or more modules or enginesconfigured to perform the functions of the computer system 600. Each ofthe modules or engines may be implemented using hardware and, in someinstances, may also utilize software, such as corresponding to programcode and/or programs stored in the main memory 608 or secondary memory610. In such instances, program code may be compiled by the processordevice 604 (e.g., by a compiling module or engine) prior to execution bythe hardware of the computer system 600. For example, the program codemay be source code written in a programming language that is translatedinto a lower level language, such as assembly language or machine code,for execution by the processor device 604 and/or any additional hardwarecomponents of the computer system 600. The process of compiling mayinclude the use of lexical analysis, preprocessing, parsing, semanticanalysis, syntax-directed translation, code generation, codeoptimization, and any other techniques that may be suitable fortranslation of program code into a lower level language suitable forcontrolling the computer system 600 to perform the functions disclosedherein. It will be apparent to persons having skill in the relevant artthat such processes result in the computer system 600 being a speciallyconfigured computer system 600 uniquely programmed to perform thefunctions discussed above.

Techniques consistent with the present disclosure provide, among otherfeatures, systems and methods for verifying proof of assertion of avalue using a hash-oriented transaction scheme. While various exemplaryembodiments of the disclosed system and method have been described aboveit should be understood that they have been presented for purposes ofexample only, not limitations. It is not exhaustive and does not limitthe disclosure to the precise form disclosed. Modifications andvariations are possible in light of the above teachings or may beacquired from practicing of the disclosure, without departing from thebreadth or scope.

What is claimed is:
 1. A method for verifying proof of assertion of avalue using a hash-oriented transaction scheme, comprising: receiving,by a receiver of a processing server, a confirmation request;identifying, by a processing device of the processing server, aconfirmation message, wherein the confirmation message includes at leastone or more chain values and is one of: included in the confirmationrequest or stored in a block included in a blockchain and identifiedusing a reference identifier included in the confirmation request;identifying, by the processing device of the processing server, adeclaration message, wherein the declaration message includes at leastan asserted value and an identity hash value; generating, by theprocessing device of the processing server, a check hash value byhashing at least the asserted value and the one or more chain values;verifying, by the processing device of the processing server, the checkhash value using the identity hash value; and transmitting, by atransmitter of the processing server, a result of the verification ofthe check hash value in response to the received confirmation request.2. The method of claim 1, further comprising: storing, in a memory ofthe processing server, the blockchain, wherein the blockchain iscomprised of a plurality of blocks and each block includes at least ablock header and one or more blockchain data entries.
 3. The method ofclaim 2, wherein the confirmation message is included in the blockincluded in the blockchain, and includes the reference identifier. 4.The method of claim 2, wherein the declaration message is stored in aprior block included in the blockchain.
 5. The method of claim 4,wherein the declaration message further includes a data entryidentifier, and the confirmation message further includes the data entryidentifier.
 6. The method of claim 2, wherein each block header includesa timestamp, the timestamp included in the block header in the blockincluded in the blockchain is later than the timestamp included in aprior block included in the blockchain that includes a blockchain dataentry comprising the declaration message.
 7. The method of claim 1,wherein the declaration message further includes one or more new chainvalues.
 8. The method of claim 1, wherein the declaration messagefurther includes one or more future values, and each of the one or morefuture values is generated by hashing one of the one or more chainvalues.
 9. A system for verifying proof of assertion of a value using ahash-oriented transaction scheme, comprising: a receiver of a processingserver configured to receive a confirmation request; a processing deviceof the processing server configured to identify a confirmation message,wherein the confirmation message includes at least one or more chainvalues and is one of: included in the confirmation request or stored ina block included in a blockchain and identified using a referenceidentifier included in the confirmation request, identify a declarationmessage, wherein the declaration message includes at least an assertedvalue and an identity hash value, generate a check hash value by hashingat least the asserted value and the one or more chain values, and verifythe check hash value using the identity hash value; and a transmitter ofthe processing server configured to transmit a result of theverification of the check hash value in response to the receivedconfirmation request.
 10. The system of claim 9, further comprising: amemory of the processing server configured to store the blockchain,wherein the blockchain is comprised of a plurality of blocks and eachblock includes at least a block header and one or more blockchain dataentries.
 11. The system of claim 10, wherein the confirmation message isincluded in the block included in the blockchain, and includes thereference identifier.
 12. The system of claim 10, wherein thedeclaration message is stored in a prior block included in theblockchain.
 13. The system of claim 12, wherein the declaration messagefurther includes a data entry identifier, and the confirmation messagefurther includes the data entry identifier.
 14. The system of claim 10,wherein each block header includes a timestamp, the timestamp includedin the block header in the block included in the blockchain is laterthan the timestamp included in a prior block included in the blockchainthat includes a blockchain data entry comprising the declarationmessage.
 15. The system of claim 9, wherein the declaration messagefurther includes one or more new chain values.
 16. The system of claim9, wherein the declaration message further includes one or more futurevalues, and each of the one or more future values is generated byhashing one of the one or more chain values.